Discrete Optimization via Simulation Using COMPASS

نویسندگان

  • L. Jeff Hong
  • Barry L. Nelson
چکیده

We propose an optimization-via-simulation algorithm, called COMPASS, for use when the performance measure is estimated via a stochastic, discrete-event simulation, and the decision variables are integer ordered. We prove that COMPASS converges to the set of local optimal solutions with probability 1 for both terminating and steady-state simulation, and for both fully constrained problems and partially constrained or unconstrained problems under mild conditions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Speeding up COMPASS for high-dimensional discrete optimization via simulation

The convergent optimization via most promising area stochastic search (COMPASS) algorithm is a locally convergent randomsearch algorithm for solving discrete optimization via simulation problems. COMPASS has drawn a significant amount of attention since its introduction. While the asymptotic convergence of COMPASS does not depend on the problem dimension, the finite-time performance of the algo...

متن کامل

An Adaptive Hyperbox Algorithm for High-Dimensional Discrete Optimization via Simulation Problems

W propose an adaptive hyperbox algorithm (AHA), which is an instance of a locally convergent, random search algorithm for solving discrete optimization via simulation problems. Compared to the COMPASS algorithm, AHA is more efficient in high-dimensional problems. By analyzing models of the behavior of COMPASS and AHA, we show why COMPASS slows down significantly as dimension increases, whereas ...

متن کامل

A Discrete Mechanics Approach to Gait Generation on Periodically Unlevel Grounds for the Compass-type Biped Robot

This paper addresses a gait generation problem for the compass-type biped robot on periodically unlevel grounds. We first derive the continuous/discrete compass-type biped robots (CCBR/DCBR) via continuous/discrete mechanics, respectively. Next, we formulate a optimal gait generation problem on periodically unlevel grounds for the DCBR as a finite dimensional nonlinear optimization problem, and...

متن کامل

Modeling and Simulation of Modern Industrial Screens using Discrete Element Method (TECHNICAL NOTE)

With progress in mineral processing technologies, particle size classification equipment has also been changed to satisfy the needs of modern plants. Accordingly, design, manufacturing and utilizing of banana screens in mineral processing plants have led to increased screening efficiency at industrial scale. Banana screen is an important invention occurred in past decade which increases screeni...

متن کامل

Hybrid Probabilistic Search Methods for Simulation Optimization

Discrete-event simulation based optimization is the process of finding the optimum design of a stochastic system when the performance measure(s) could only be estimated via simulation. Randomness in simulation outputs often challenges the correct selection of the optimum. We propose an algorithm that merges Ranking and Selection procedures with a large class of random search methods for continu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Operations Research

دوره 54  شماره 

صفحات  -

تاریخ انتشار 2006